Informatics Publishing Limited

M. Krishnamurthy ¹, K. Manivannan ², A. Chilambuchelvan ³, E. Rajalakshmi ⁴, A. Kannan ⁵

Affiliations
1 CSE, KCG College of Technology, Chennai - 600097, Tamil Nadu, IN
2 IT, RMK Engineering College, Kavaraipettai, Thiruvallur District - 601206, Tamil Nadu, IN
3 RMK Engineering College, Kavaraipettai, Thiruvallur District - 601206, Tamil Nadu, IN
4 CSE, SVCE, Sriperumbudur - 602117, Tamil Nadu, IN
5 IST, Anna University, Chennai - 600025, Tamil Nadu, IN

Abstract

Frequent item sets is one of the most investigated fields of data mining. The significant feature is to find new techniques to reduce candidate item sets in order to generate frequent item sets efficiently. This paper introduces an efficient algorithm called Enhanced Candidate Generation for Frequent item set Generation (ECG for FIG) for finding frequent item sets from large databases. The existing algorithm for frequent item set generation scan the original database more than once, use more storage space, take more processing time. The proposed algorithm gives a solution to this by representing the transactions in the database with decimal numbers instead of binary values and strings. The original database is scanned only once and is converted into an equivalent decimal value to reduce the storage space. The subset generation concept is used to generate frequent item sets. Thus the proposed algorithm reduces the scanning time, processing time and the storage space respectively. When compared with the existing algorithms, the proposed algorithm takes very less execution time and memory. When implemented the algorithm using java and tested with WEKA tool, for 400 transactions of twenty five items, ECG for FIG is taking only 800 bytes of memory and 2000000000 ns (two seconds), whereas all the other above mentioned algorithms are taking 20800 bytes of memory and more than two seconds.

Keywords

Decimal Conversion, Frequent Item Set Generation, Redundancy Elimination, Storage Space Reduction

Full Text

 

A. A. Abd El-Aziz ¹, A. Kannan ²

Affiliations
1 Cairo University, EG
2 Anna University, IN

Abstract

XACML (extensible Access Control Markup Language) is an open standard language based on XML. It’s the de facto language designed to describe the security policy and the access permission of network service, digital rights management and enterprise security applications information. RBAC profile of XACML is used to express policies that use role based access control. However, RBAC access decision is not influenced by the spatiotemporal context of both the subjects and the objects in the system. In this paper, we extend this profile with spatiotemporal RBAC profile. It incorporates different constraints dependent on spatiotemporal conditions. The spatiotemporal conditions allow to enhance the access control of XACML by specifying a wide variety of spatiotemporal access control policies. The extension facilitates the administration by providing a convenient and efficient way of managing access control policies.

Keywords

XACML, RBAC, Access Control, Spatiotempo-Ral Policy.

Full Text

     

K. Uma ¹, P. Geetha ¹, A. Kannan ²

Affiliations
1 Department of CSE, SRM Easwari Engineering College & Anna University, Chennai, IN
2 Department of CSE, SRM Easwari Engineering College & Anna University, Chennai, IN

Abstract

In Existing systems, compound document compression follow a top down approach that first segments the original image into three distinct layers ,the background layer containing smooth objects, the foreground layer containing information regarding text and graphics colors and mask layer by using the MRC model. These distinct layers are then compressed individually by various encoders like JPEG2000, H.264/AVC Intra, and Digipaper, MMP algorithm to compress the document. In this paper, the existing scheme uses a block based classification that separates pictorial macro-blocks in to text and graphics ones and the macro-blocks are signalled using a binary mask. Each of these two types of macro-blocks are then encoded using a version of the Multidimensional Multiscale Parser (MMP) algorithm specifically designed to encode it. The non-smooth blocks (text/graphics) are compressed using MMP-text algorithm and the smooth blocks are compressed by means of MMP-FP (flexible Partition (FP) algorithm. In proposed scheme, Macro blocks are segmented with the use of morphological filters and its separated blocks are using R-D optimization techniques. The Modified MMP algorithms are implemented to efficiently encode the text blocks and the image blocks. For encoding text blocks Modified MMP-Text algorithm is used, where the binary tree based segmentation process is implemented. For encoding the image blocks, Modified MMP-FP algorithm is implemented, where Quad-tree based segmentation process is carried out. Modified MMP has an advantage that it is not sensitive to pixel classification errors. Also it increases the compression ratio, improves the compression effectiveness, improves the image quality, reduces the search space between the pixels and also minimizes the computational complexity.

Keywords

Morphological Operation, R-D Optimization, Modified MMP Compression, Modified MMP-FP Compression, Dictionary Creation, Pattern Matching.

Full Text

     

Shashi Ranjan ¹, Shashi Kumar ¹, Vickey Kumar ¹, Satendra Kumar ¹, Sanjiv Kumar Patel ¹, L. Ramesh ², A. Kannan ³

Affiliations
1 EEE Department, Dr. M.G.R Educational and Research Institute, Chennai, IN
2 Dean - E& T Department, Dr. M.G.R Educational and Research Institute, Chennai, IN
3 EEE Department, Dr. M.G.R Educational and Research Institute, Chennai, IN

Abstract

The challenges in the present Distribution System, how to manage the DG power for smart operation and control with energy efficiency. In connection with this, Indian Government had taken keen steps to motivate the public customers to install DG nearer to their places to generate their own generation. This paper discusses about how we can install the restructured micro grid to save the energy for the Distribution Feeder. The existing Indian Distribution Feeder simulated in PSCAD and Restructured to MG1 and MG2 with Interconnected connection to Electricity Board. The performance of the proposed MG studied for steady state and transient conditions.

Keywords

Distribution System, Micro Grid, Solar and Wind.

Full Text

     

M. Krishnamurthy ¹, A. Kannan ², R. Baskaran ², S. Kanmanirajan ¹

Affiliations
1 Sri Venkateswara College of Engineering, Sriperumbudur, Chennai, IN
2 Department of Computer Science and Engineering, Anna University, Chennai, IN

Abstract

Association rule mining is to find association relationships among large data sets. Mining frequent patterns is an important aspect in association rule mining. Most of the popular associationship rule mining methods are having performance bottleneck for database with different characteristics of data such as dense vs. sparse. In this paper, an efficient algorithm named Temporal FP-Tree (Frequent Pattern-Tree) algorithm and the FP-tree structure is presented to mine frequent patterns, conditional pattern bases and sub- conditional pattern tree recursively .This algorithm is used to mine frequent patterns from temporal database and it needs limited memory space. When dataset becomes dense it can be scaled up to large database by partitioning it, conditionally temporal FP-tree can be constructed dynamically as part of mining.

Keywords

Frequent Item set, Calendar Schema, Temporal Association Rule Mining, Temporal Data Mining and Temporal Database.

Full Text

     

M. Krishnamurthy ¹, A. Kannan ², R. Baskaran ², K. Mythili ¹

Affiliations
1 Sri Venkateswara College of Engineering, Sriperumbudur, Chennai, IN
2 Department of Computer Science and Engineering, Anna University, Chennai, IN

Abstract

A temporal association rule is an association rule that holds during specific time intervals. The problem is to discover complete set of frequent patterns with respect to calendar schema from a set of time stamped transactions. This paper uses the data structure H-struct (Hyper-structure) of  Hmine-rev, and incorporated temporal aspects and it is called T-Hmine-rev (Temporal-Hmine-reverse). Hmine-rev is a revised algorithm of H-mine (Hyper-structure mining) which is used for mining frequent patterns and it does not need any adjustment of H-struct links structure like H-mine. Hmine-rev works well on sparse dataset and H-struct is used for fast mining on time-based dataset.

Keywords

Association Rule, Calendar Schema, Frequent Patterns, H-Struct, Temporal Association Rule.

Full Text

     

K. Selvakumar ¹, L. Sai Ramesh ², A. Kannan ²

Affiliations
1 School of Computing Science and Engineering, VIT University, Vellore - 632014, Tamil Nadu, IN
2 Department of Information Science and Technology, CEG, Anna University, Chennai - 600025, Tamil Nadu, IN

Abstract

To gain information about user interests in Web pages is needed to advance in Web security. An approach to pick up that information includes understanding the client's perusing conduct, examining the Web log records with the procedures of preprocessing and client clustering. Time spent on Web pages and the types of operations show the degree of a Web user's intention. The data set comprises of Web log files obtained by collecting the user logs during a six month period. A new enhanced K-means clustering algorithm proposed in this paper for grouping user based on their preferred Web content and their temporal constraints. The enhanced K-mean clustering calculates initial centroids instead of random choice and uses time intervals to heighten the security and performance. Utilizing this methodology, client access designs with comparable looking practices are assembled into a particular class amid a particular time interval. Also secured communication among the various users groups will be achieved through hill cipher technique.

Keywords

Preprocessing, Security and Hill Cipher, Temporal K-Means Algorithm, Web User Categorization.

Full Text

   

A. Kannan

Abstract

"Eating out" in restaurants and other catering establishments is on the increase in most of the countries. This has led to the study of new problems in large scale food preparation, kitchen sanitation and training of personnel in quantity cookery.

Full Text

     

A. Kannan

Abstract

Based on the successful experiments of scientists at Purdue University in evolving high lysine content of corn, the Rockefeller Foundation was able to formulate in December 1965, an international programme in quality improvement of the cereal grains consumed by man and

Full Text

     

A. Kannan

Abstract

The report under review is another landmark in the expanding activities of the Nutrition Research Laboratories. The nature and extent of the widespread activities cannot be enumerated or explained in a short review of this nature. The Clinical Division of the laboratories has been expanded and organized in three sections of Deficiency Diseases, Metabolic Diseases and Endocrinology and Haemotology.

Full Text

     

A. Kannan ¹, R . P. Devadas ¹

Affiliations
1 Sri Avinashilingam Home Science College, Coimbatore, IN

Abstract

Considerable interest has been evinced in the investigation on rice to increase its yield and improve its nutritive value through better cultural methods and processing.

Full Text

     

A. Kannan

Abstract

Food science has made very rapid progress in recent years and interest has considerably increased in processing and utilizing fruits and vegetables.

Full Text

     

A. Kannan

Abstract

This very important book is a timely publication bringing under one cover all relevant information on the subject dealing with the principles and practices adopted in modern canning of foodstuffs.

Full Text

     

S. Veeramalai ¹, N. Jaisankar ¹, A. Kannan ¹

Affiliations
1 Department of Information Science and Technology, Anna University, Chennai-600025, Tamil Nadu, IN

Abstract

Web usage mining is the type of Web mining activity that involves the automatic discovery of user access patterns from one or more Web servers. In this paper we analyze the pattern using different algorithms like Apriori, Hash tree and Fuzzy and then we used enhanced Apriori algorithm to give the solution for Crisp Boundry problem with higher optimized efficiency while comparing to other algorithms.

Keywords

Data Mining, Web Mining, Web Log, Association Rule, Apriori, Fuzzy.

Full Text

   

G. Saranya ¹, H. K. Nehemiah ¹, A. Kannan ², V. Pavithra ³

Affiliations
1 Ramanujan Computing Centre, College of Engineering Guindy, Anna University, Chennai - 600025, Tamil Nadu, IN
2 Information Science and Technology, College of Engineering Guindy, Anna University, Chennai - 600025,Tamil Nadu, IN
3 Computer Science and Engineering, College of Engineering Guindy, Anna University, Chennai - 600025, Tamil Nadu, IN

Abstract

Objective: Code smells indicate the design decay in software applications. The code smells existence in the software will hinder the understandability of code and possibly increases changes and fault proneness. Methods / Statistical Analysis: To remove the code smells’ from the software applications refactoring operations are applied which in turn improves the software system structure without changing its overall behaviour. Generally, in a large sized system, code smell cannot be fixed automatically. Therefore based on the maintainer’s preference, the prioritized list of refactoring sequences to fix the code smells is essential. Findings: Majority of the refactoring just rely on the structural information, which fails to preserve the construct semantics, minimization of changes and the use of development history. To overcome this, in this work, the Strength Pareto Evolutionary Algorithm (SPEA) is used to prioritize the list of refactoring operations that maximize the quality improvement, constructs semantics coherence and preserving the consistency with the previous refactoring. This work is carried out on two open source software Xerces-J and J Hot Draw. Blob, shotgun surgery, functional decomposition, data class, Swiss army knife and schizophrenic class code smells’ are considered for prioritizing refactoring operations in these open source system. SPEA is evaluated using the metrics Code smell Correction Ratio (CCR) and Refactoring Meanings (RM). Application / Improvements: SPEA is compared with other algorithms namely Non-dominated Sorting Genetic Algorithm II (NSGA II) and Chemical Reaction Optimization (CRO), to prove its efficiency in prioritizing code smell correction tasks.

Keywords

Code Smells, Maintenance, Prioritizing, Refactoring, Search Based Software Engineering, Strength Pareto Evolutionary Algorithm (SPEA)

Full Text